#include"sort.h"
void test01()
{
	//int arr[]={5,3,9,7,1,8};
	int arr[]={6,1,2,9,4,2,4,1,4};
	int n=sizeof(arr)/sizeof(int);
	printf("排序前：");
	SortPrint(arr,n);
	//InsertSort(arr,n);
	//ShellSort(arr,n);
	//SelectSort(arr,n);
	//QuickSort(arr,0,5);
	//QuickSortNonR(arr,0,5);
	//MergeSort(arr,n);
	//MergeSortNonR(arr,0,8);
	//CountSort(arr,n);
	printf("排序后：");
	SortPrint(arr,n);
}
void test02()
{
	//CreateNData();
	const char* file1="file1.txt";
	const char* file2="file2.txt";
	const char* mfile="mfile.txt";
	FILE* fout=fopen("data.txt","r");
	if(fout==NULL)
	{
		perror("fopen fail");
		return;
	}
	ReadNDataSortToFile(fout,100000,file1);
	ReadNDataSortToFile(fout,100000,file2);
	while(1)
	{
		MergeFile( file1,file2,mfile);
		//删除file12
		remove(file1);
		remove(file2);
		//重命名mfile
		rename(mfile,file1);
		if(ReadNDataSortToFile(fout,100,file2)==0)
		{
			//再次读取一个都读不到，说明已经读完
			//已经归并完成，结果在file1
			break;
		}

	}
	fclose(fout);
}
// 测试排序的性能对⽐  
void TestOP() 
{ 
 srand(time(0)); 
 const int N = 100000;
 int* a1 = (int*)malloc(sizeof(int)*N);
 int* a2 = (int*)malloc(sizeof(int)*N);
 int* a3 = (int*)malloc(sizeof(int)*N);
 int* a4 = (int*)malloc(sizeof(int)*N);
 int* a5 = (int*)malloc(sizeof(int)*N);
 int* a6 = (int*)malloc(sizeof(int)*N);
 int* a7 = (int*)malloc(sizeof(int)*N);
 for (int i = 0; i < N; ++i)
 {
 a1[i] = rand();
 a2[i] = a1[i];
 a3[i] = a1[i];
 a4[i] = a1[i];
 a5[i] = a1[i];
 a6[i] = a1[i];
 a7[i] = a1[i];
 }
 int begin1 = clock();
 InsertSort(a1, N);
 int end1 = clock();

 int begin2 = clock();
 ShellSort(a2, N);
 int end2 = clock();

 int begin3 = clock();
 SelectSort(a3, N);
 int end3 = clock();

 int begin4 = clock();
 HeapSort(a4, N);
 int end4 = clock();

 int begin5 = clock();
 QuickSort(a5, 0, N-1);
 int end5 = clock();

 int begin6 = clock();
 //MergeSort(a6, N);
 int end6 = clock();

 int begin7 = clock();
 BubbleSort(a7, N);
 int end7 = clock();

 printf("InsertSort:%d\n", end1 - begin1);
 printf("ShellSort:%d\n", end2 - begin2);
 printf("SelectSort:%d\n", end3 - begin3);
 printf("HeapSort:%d\n", end4 - begin4);
 printf("QuickSort:%d\n", end5 - begin5);
 printf("MergeSort:%d\n", end6 - begin6);
 printf("BubbleSort:%d\n", end7 - begin7);

 free(a1);
 free(a2);
 free(a3);
 free(a4);
 free(a5);
 free(a6);
 free(a7);
}
int main()
{
	//test01();
	test02();
	//TestOP();
	return 0;
}

